A fast approximation algorithm for the multicovering problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Fast Approximation Algorithm for the Subset-Sum Problem
The subset-sum problem (SSP) is deened as follows: given a positive integer bound and a set of n positive integers nd a subset whose sum is closest to, but not greater than, the bound. We present a randomized approximation algorithm for this problem with linear space complexity and time complexity of O(n log n). Experiments with random uniformly-distributed instances of SSP show that our algori...
متن کاملFast Approximation Algorithm for the 1-Median Problem
We present a fast approximation algorithm for the 1-median problem. Our algorithm can be applied to metric undirected graphs with node weight. Given a node v, our algorithm repeatedly executes a process of finding a node with higher centrality,in which an approximate centrality of each node v’ is calculated for the subgraph called the best kNSPGS of (v,v’). The best kNSPGS of (v,v’) is a subgra...
متن کاملFast Approximation Algorithm for Restricted Euclidean Bottleneck Steiner Tree Problem
Bottleneck Steiner tree problem asks to find a Steiner tree for n terminals with at most k Steiner points such that the length of the longest edge in the tree is minimized. The problem has applications in the design of wireless communication networks. In this paper we study a restricted version of the bottleneck Steiner tree problem in the Euclidean plane which requires that only degree-2 Stein...
متن کاملA Fast Algorithm for Spherical Basis Approximation
Radial basis functions appear in a wide field of applications in numerical mathematics and computer science. We present a fast algorithm for scattered data interpolation and approximation on the sphere with spherical radial basis functions of different spatial density. We discuss three settings, each leading to a special structure of the interpolation matrix allowing for an efficient implementa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1986
ISSN: 0166-218X
DOI: 10.1016/0166-218x(86)90016-8